New Bounds for the Identric Mean of Two Arguments
نویسنده
چکیده
Given two positive real numbers x and y, let A(x, y), G(x, y), and I(x, y) denote their arithmetic mean, geometric mean, and identric mean, respectively. Also, let Kp(x, y) = p √ 2 3A p(x, y) + 13G p(x, y) for p > 0. In this note we prove that Kp(x, y) < I(x, y) for all positive real numbers x 6= y if and only if p ≤ 6/5, and that I(x, y) < Kp(x, y) for all positive real numbers x 6= y if and only if p ≥ (ln 3− ln 2)/(1− ln 2). These results, complement and extend similar inequalities due to J. Sándor [2], J. Sándor and T. Trif [3], and H. Alzer and S.-L. Qiu [1].
منابع مشابه
Optimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means
We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)
متن کاملOptimal Convex Combinations Bounds of Centroidal and Harmonic Means for Weighted Geometric Mean of Logarithmic and Identric Means
In this paper, optimal convex combination bounds of centroidal and harmonic means for weighted geometric mean of logarithmic and identric means are proved. We find the greatest value λ(α) and the least value Δ(α) for each α ∈ (0,1) such that the double inequality: λC(a,b)+(1−λ)H(a,b) < Lα (a,b)I1−α (a,b) < ΔC(a,b)+(1−Δ)H(a,b) holds for all a,b > 0 with a = b. Here, C(a,b), H(a,b) , L(a,b) and I...
متن کاملSome New Inequalities for Means of Two Arguments
We prove certain new inequalities for special means of two arguments, including the identric, arithmetic, and geometric means. 2000 Mathematics Subject Classification. Primary 26D99, 65D32.
متن کاملBest Possible Bounds for Neuman-Sándor Mean by the Identric, Quadratic and Contraharmonic Means
and Applied Analysis 3 Lemma 1. The double inequality
متن کاملNew bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008